Paraconsistency and Topological Semantics

نویسنده

  • Can Baskent
چکیده

The well-studied notion of deductive explosion describes the situation where any formula can be deduced from an inconsistent set of formulas. In other words, in deductively explosive logics, we have {φ,¬φ} ⊢ ψ for all formulas φ, ψ where ⊢ is a logical consequence relation. In this respect, both “classical” and intuitionistic logics are known to be deductively explosive. Paraconsistent logic, on the other hand, is the umbrella term for logical systems where the logical consequence relation is not explosive. Variety of philosophical and logical objections can be raised against paraconsistency, and almost all of these objections can be defended in a rigorous fashion. Here, we will not be concerned about the philosophical implications of it, yet we refer the reader to the following references for comprehensive defenses of paraconsistency with a variety of well-structured applications chosen from mathematics and philosophy with a rigorous history of the subject (?; Priest, 2002; Priest, 1998; ?).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Functorial semantics of topological theories

Following the categorical approach to universal algebra through algebraic theories, proposed by F.~W.~Lawvere in his PhD thesis, this paper aims at introducing a similar setting for general topology. The cornerstone of the new framework is the notion of emph{categorically-algebraic} (emph{catalg}) emph{topological theory}, whose models induce a category of topological structures. We introduce t...

متن کامل

Paraconsistency in the semantics of integrity constraints

Deductive databases are paraconsistent theory systems which change over time. They do not support the inference of arbitrary consequences from inconsistent components, such as contradictory definitions of database relations (predicates) or violated integrity constraints. Moreover, computed answers in deductive databases typically make sense, almost no matter to which degree consistency or integ...

متن کامل

Information, Negation, and Paraconsistency

This paper begins by arguing that a truth conditional approach to the semantics for relevant logic is unnatural. Rather, we should adopt an informational semantics. On this view, the indices in the RoutleyMeyer semantics are situations, which can be said either to contain or not contain, particular pieces of information. Valid inference, then, is seen as information preservation, not truth pres...

متن کامل

Public Announcements, Topology and Paraconsistency

In this paper, we discuss public announcement logic in topological context. Then, as an interesting application, we consider public announcement logic in a paraconsistent topological model.

متن کامل

A Routley-meyer Semantics for Ackermann’s Logics of “strenge Implikation”

The aim of this paper is to provide a Routley-Meyer semantics for Ackermann’s logics of “strenge Implikation” Π′ and Π′′. Besides the Disjunctive Syllogism, this semantics validates the rules Necessitation and Assertion. Strong completeness theorems for Π′ and Π′′ are proved. A brief discussion on Π′, Π′′ and paraconsistency is included.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1107.4939  شماره 

صفحات  -

تاریخ انتشار 2010